Proof rules for purely quantum programs
نویسندگان
چکیده
We apply the notion of quantum predicate proposed by D’Hondt and Panangaden to analyze a purely quantum language fragment which describes the quantum part of a future quantum computer in Knill’s architecture. The denotational semantics, weakest precondition semantics, and weakest liberal precondition semantics of this language fragment are introduced. To help reasoning about quantum programs involving quantum loops, we extend proof rules for classical probabilistic programs to our purely quantum programs.
منابع مشابه
Semantics of a purely quantum programming language
Quantum algorithm is the key to dig the potential power of quantum computing and make quantum computation more efficient than its classical analogue. However, present methods of designing quantum algorithms are too tricky and lack of systematic development. The aim of quantum programming languages is to deal with this problem and try to provide a high-level and unifying description and treatmen...
متن کاملProof rules for the correctness of quantum programs
We apply the notion of quantum predicate proposed by D’Hondt and Panangaden to analyze a simple language fragment which may describe the quantum part of a future quantum computer in Knill’s architecture. The notion of weakest liberal precondition semantics, introduced by Dijkstra for classical deterministic programs and by McIver and Morgan for probabilistic programs, is generalized to our quan...
متن کاملProcess Logic and Duality Part I: Sequential Processes
We present typed process logics for the π-calculus with linear/affine type disciplines. Built on the preceding studies on logics for programs and processes, simple systems of assertions are developed, capturing the classes of behaviours ranging from purely functional interactions to those with destructive update, local state and genericity. A central feature of the logic is representation of th...
متن کاملSemantics of a pure quantum programming language
Quantum algorithm is the key to dig the potential power of quantum computing and make quantum computation more efficient than classical analogue. However, present methods of designing quantum algorithms are too tricky and lack of systematic development. The aim of quantum programming languages is to deal with this problem and try to provide a high-level and unifying description and treatment of...
متن کاملA Formal Approach to Unconditional Security Proofs for Quantum Key Distribution
We present an approach to automate Shor-Preskill style unconditional security proof of QKDs. In Shor-Preskill’s proof, the target QKD, BB84, is transformed into another QKD based on an entanglement distillation protocol (EDP), which is more feasible for direct analysis. We formalized heir method as program transformation in a quantum programming language, QPL. The transform is defined as rewrit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/cs/0507043 شماره
صفحات -
تاریخ انتشار 2005